Computing the convex hull of a simple polygon
نویسنده
چکیده
An algorithm for computing the convex hull of a simple polygon is presented. Its correctness and complexity are also shown. Computational geometry Convex hull Simple polygon Algorithm
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملEnhanced Way for Computing Smallest Convex Polygon and Euler Number
A convex hull is a polygon which encloses all given set of points.Euler number or Euler characteristic of an image has proven to be an important feature in many image analyses and visual inspection applications. This paper presents an algorithm for fast computing the convex hull of a planar scattered point set, which pre-strike an initial convex hull boundary, remove internal points in the boun...
متن کاملSolving Geometric Problems with the Rotating Calipers *
Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be us...
متن کاملComputing Convex Hull in a Floating Point Arithmetic
We present a numerically stable and time and space complexity optimal algorithm for constructing a convex hull for a set of points on a plane. In contrast to already existing numerically stable algorithms which return only an approximate hull, our algorithm constructs a polygon that is truly convex. The algorithm is simple and easy to implement.
متن کاملFinding the Convex Hull of a Simple Polygon
The problem of finding the convex hull of a planar set of points P, that is, finding the smallest convex region enclosing P, arises frequently in computer graphics. For example, to fit P into a square or a circle, it is necessary and sufficient that H(P), the convex hull of P, fits; and since it is usually the case that H(P) has many fewer points than P has, it is a simpler object to manipulate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 22 شماره
صفحات -
تاریخ انتشار 1989